Using Descriptions of Trees in a Tree Adjoining Grammar

نویسنده

  • K. Vijay-Shanker
چکیده

This paper describes a new interpretation of Tree Adjoining Grammars (TAG) that allows the embedding of TAG in the unification framework in a manner consistent with the declarative approach taken in this framework. In the new interpretation we present in this paper, the objects manipulated by a TAG are considered to be descriptions of trees. This is in contrast to the traditional view that in a TAG the composition operations of adjoining and substitution combine trees. Borrowing ideas from Description Theory, we propose quasi-trees as a means to represent partial descriptions of trees. Using quasi-trees, we are able to justify the definition of feature structurebased Tree Adjoining Grammars (FTAG) that was first given in Vijay-Shanker (1987) and VijayShanker and Joshi (1988). In the definition of the FTAG formalism given here, we argue that a grammar manipulates descriptions of trees (i.e., quasi-trees); whereas the structures derived by a grammar are trees that are obtained by taking the minimal readings of such descriptions. We then build on and refine the earlier version of FTAG, give examples that illustrate the usefulness of embedding TAG in the unification framework, and present a logical formulation (and its associated semantics) of FTA G that shows the separation between descriptions of well-formed structures and the actual structures that are derived, a theme that is central to this work. Finally, we discuss some questions that are raised by our new interpretation of the TAG formalism: questions dealing with the nature and definition of the adjoining operation (in contrast to substitution), its relation to multi-component adjoining, and the distinctions between auxiliary and initial structures.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

D-Tree Substitution Grammars

There is considerable interest among computational linguists in lexicalized grammatical frameworks; lexicalized tree adjoining grammar (LTAG) is one widely studied example. In this paper, we investigate how derivations in LTAG can be viewed not as manipulations of trees but as manipulations of tree descriptions. Changing the way the lexicalized formalism is viewed raises questions as to the des...

متن کامل

Exploring the Underspeciied World of Lexicalized Tree Adjoining Grammars

This paper presents a precise characterization of the underspeciication found in Lexicalized Tree Adjoining Grammars, and shows that, in a sense, the same degree of underspeciication is found in Lexicalized D-Tree Substitution Grammars. Rather than describing directly the nature of the elementary objects of the grammar, we achieve our objective by formalizing the way in which underspeciication ...

متن کامل

Integrating a Unification-Based Semantics in a Large Scale Lexicalised Tree Adjoining Grammar for French

In contrast to LFG and HPSG, there is to date no large scale Tree Adjoining Grammar (TAG) equiped with a compositional semantics. In this paper, we report on the integration of a unification-based semantics into a Feature-Based Lexicalised TAG for French consisting of around 6 000 trees. We focus on verb semantics and show how factorisation can be used to support a compact and principled encodi...

متن کامل

Scope and Situation Binding in LTAG Using Semantic Unification

This paper sets up a framework for Lexicalized Tree Adjoining Grammar (LTAG) semantics that brings together ideas from different recent approaches addressing some shortcomings of LTAG semantics based on the derivation tree. The approach assigns underspecified semantic representations and semantic feature structure descriptions to elementary trees. Semantic computation is guided by the derivatio...

متن کامل

Obtaining Trees from Their Descriptions :

2 The authors are indebted to the referees for considerable help in clarifying the presentation of this material. Abstract Partial descriptions are sets of constraints which do not necessarily determine a unique object. Two related issues arise when objects are speciied by partial descriptions. The rst asks whether a given description is satissed by any object. The second seeks to produce, from...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:
  • Computational Linguistics

دوره 18  شماره 

صفحات  -

تاریخ انتشار 1992